Almost Optimal Solutions to k-Clustering Problems

نویسندگان

  • Pankaj Kumar
  • Piyush Kumar
چکیده

Pankaj Kumar1 and Piyush Kumar2 1 Purdue University 2 Florida State University (a) American Cities (b) Lyria bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bcbc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bcbc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bcbc bc bc bc bc bc bc bc bc bc bc bc bc bcbc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bcbc bc bc bc bc bc bc bc bc bc bc bcbc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bcbc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc bc

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach

  The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...

متن کامل

A hybrid DEA-based K-means and invasive weed optimization for facility location problem

In this paper, instead of the classical approach to the multi-criteria location selection problem, a new approach was presented based on selecting a portfolio of locations. First, the indices affecting the selection of maintenance stations were collected. The K-means model was used for clustering the maintenance stations. The optimal number of clusters was calculated through the Silhou...

متن کامل

GROUND MOTION CLUSTERING BY A HYBRID K-MEANS AND COLLIDING BODIES OPTIMIZATION

Stochastic nature of earthquake has raised a challenge for engineers to choose which record for their analyses. Clustering is offered as a solution for such a data mining problem to automatically distinguish between ground motion records based on similarities in the corresponding seismic attributes. The present work formulates an optimization problem to seek for the best clustering measures. In...

متن کامل

A Variant of Genetic Algorithm Based Categorical Data Clustering for Compact Clusters and an Experimental Study on Soybean Data for Local and Global Optimal Solutions

Almost all partitioning clustering algorithms getting stuck to the local optimal solutions. Using Genetic algorithms (GA) the results can be find globally optimal. This piece of work offers and investigates a new variant of the Genetic algorithm (GA) based k-Modes clustering algorithm for categorical data. A statistical analysis have been done on the popular categorical dataset which shows the ...

متن کامل

Efficient global clustering using the greedy elimination method - Electronics Letters

Introduction: The K-means algorithm is used widely either as a stand-alone clustering method, or as a fast method for computing the optimal initial cluster centres for more expensive clustering methods. It employs a simple iterative scheme that performs hill climbing from initial centres, whose values are usually randomly picked from the training data. Although the algorithm is very efficient, ...

متن کامل

Genetic Algorithm-based Chaos Clustering Approach for Optimizing Construction Timecosttradeoff Problems

Time-cost tradeoff (TCT) problems have been studied extensively in construction management literatures. TCT decisions, as combinatorial optimization problems, are difficult to find out their optimal solutions. However, Genetic Algorithms (GA) coupled with chaos and K-means clustering approach, named KCGA, can tackle these problems effectively. KCGA has successfully incorporated two opposite pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Comput. Geometry Appl.

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2010